Degree-based indices computation for special chemical molecular structures using edge dividing method
نویسندگان
چکیده
منابع مشابه
On discriminativity of vertex-degree-based indices
A recently published paper [T. Došlić, this journal 3 (2012) 25-34] considers the Zagreb indices of benzenoid systems, and points out their low discriminativity. We show that analogous results hold for a variety of vertex-degree-based molecular structure descriptors that are being studied in contemporary mathematical chemistry. We also show that these results are straightforwardly obtained by u...
متن کاملM-polynomial and degree-based topological indices
Let $G$ be a graph and let $m_{ij}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The {em $M$-polynomial} of $G$ is introduced with $displaystyle{M(G;x,y) = sum_{ile j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...
متن کاملchemical recycling of polycarbonate waste using conventional heating and microwave assisted method
پلی کربنات یکی از پلاستیکهای مهمی است که به صورت گسترده در تولید لوحهای فشرده، قطعات رایانه، مواد ساختمانی و غیره مورد استفاده قرار می گیرد. این پلیمر بصورت عمده از تراکم مونومر بیس فنولa (bpa) و کربنیل کلرید یا دی متیل کربنات ها بدست می آید. در سالهای اخیر بازیافت شیمیایی پلی کربنات بیشتر مورد توجه بوده است. بازیافت شیمیایی پلی کربنات برای بدست آوردن مواد اولیه آن با روشهای متفاوتی مانند تجزی...
Extremal problems for degree-based topological indices
For a graph G, let σ(G) = ∑ uv∈E(G) 1 √ dG(u)+dG(v) ; this defines the sum-connectivity index σ(G). More generally, given a positive function t, the edge-weight t-index t(G) is given by t(G) = ∑ uv∈E(G) t(ω(uv)), where ω(uv) = dG(u) + dG(v). We consider extremal problems for the t-index over various families of graphs. The sum-connectivity index satisfies the conditions imposed on t in each ext...
متن کاملNew Multi-dividing Ontology Learning Algorithm Using Special Loss Functions
As an important data structure model, ontology has become one of the core contents in information science. Multi-dividing ontology algorithm combines the advantages of graph structure and learning algorithms proved to have high efficiency. In this paper, in terms of multi-dividing proper loss functions, we propose new multi-dividing ontology learning algorithms for similarity measure and ontolo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Nonlinear Sciences
سال: 2016
ISSN: 2444-8656
DOI: 10.21042/amns.2016.1.00009